Mock Tridiagonal Systems
نویسندگان
چکیده
We introduce the notion of a mock tridiagonal system. This is a generalization of a tridiagonal system in which the irreducibility assumption is replaced by a certain nonvanishing condition. We show how mock tridiagonal systems can be used to construct tridiagonal systems that meet certain specifications. This paper is part of our ongoing project to classify the tridiagonal systems up to isomorphism.
منابع مشابه
A Parallel Algorithm for Circulant Tridiagonal Linear Systems
In this paper, based upon the divide-and-conquer strategy, we propose a parallel algorithm for solving the circulant tridiagonal systems, which is simpler than the two previous algorithms proposed by Agui and Jimenez ( 1995) and Chung et al. ( 1995). Our algorithm can be easily generalized to solve the tridiagonal systems, the block-tridiagonal systems, and the circulant block-tridiagonal syste...
متن کاملDiagonally Stable Tridiagonal Switched Linear Systems
Abstract: A stability analysis is carried out for certain classes of switched linear systems with tridiagonal structure, under arbitrary switching signal. This analysis is made using diagonal common quadratic Lyapunov functions. Namely, necessary and sufficient conditions for the existence of such Lyapunov functions are proposed for second order switched systems and for third order switched sys...
متن کاملParallel Solvers for Almost-Tridiagonal Linear Systems
The problem of solving tridiagonal systems on parallel machines has been studied extensively. This paper examines an existing parallel solvers for tridiagonal systems and extends this divide-and-conquer algorithm to solving almost-tridiagonal systems, systems consisting of a tridiagonal matrix with non-zeros elements in the upper right and lower left corners. In addition to a sketch of a solver...
متن کاملA VLSI Fast Solver for Tridiagonal Linear Systems
In this paper, the area-time complexity of a VLSI solver for tridiagonal linear systems is studied. Both a lower and an upper bound are derived which meet to within the exponent of the logarithmic factor. The proposed VLSI design derives from the parallel version of the well-known odd-even reduction algorithm [7] for tridiagonal linear systems, which requires O(log n) parallel steps. Then, the ...
متن کاملA New Symbolic Algorithm for Solving General Opposite-Bordered Tridiagonal Linear Systems
In the current article we propose a new efficient, reliable and breakdown-free algorithm for solving general opposite-bordered tridiagonal linear systems. An explicit formula for computing the determinant of an opposite-bordered tridiagonal matrix is investigated. Some illustrative examples are given.
متن کامل